Modal logic programming revisited
نویسنده
چکیده
We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as meta-clauses, optimizations for the version of MProlog without existential modal operators, as well as iterative deepening search and tabulation. Our SLD-resolution calculi for MProlog in a number of modal logics are still strongly complete when resolution cycles are in the standard form and optimized sets of rules are used. We also show that the labelling technique used in our direct approach is relatively better than the Skolemization technique used in the translation approaches for modal logic programming.
منابع مشابه
Suhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملTemporal and Modal Logic Programming :
This paper presents a structured, annotated bibliography of extensions of logic programming based on temporal and modal logics. Temporal and modal logic programming is a new area of research, which gained momentum in the late 1980'ies. The paper discusses temporal and modal logic programming under three headings: (1) interval logic programming , (2) temporal logic programming, and (3) modal log...
متن کاملModal logics of sabotage revisited
Sabotage modal logic was proposed in 2003 as a format for analyzing games that modify the graphs they are played on. We investigate some model-theoretic and proof-theoretic aspects of sabotage modal logic, which has largely come to be viewed as an early dynamic logic of graph change. Our first contribution is a characterization theorem for sabotage modal logic as a fragment of first-order logic...
متن کاملKripke completeness revisited
The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for...
متن کاملStructural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with coalgebraic modal logic is re-examined and improved in some aspects. Firstly, a more abstract, conceptual proof of the main compositionality theorem is given, based on an understanding of modal logic as a study of coalgebras in slice categories of adjunctions. Secondly, a more concrete under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 19 شماره
صفحات -
تاریخ انتشار 2009